EDBT 2010

Fast Algorithms for Top%2Dk Approximate String Matching.

Fires on the Web Towards Efficient Exploring Historical Web Graphs.

Low Power Management of OLTP Applications Considering Disk Drive Power Saving Function.

A Study on Workload Imbalance Issues in Data Intensive Distributed Computing.

An Interactive Visualization Framework for Time%2DSeries of Web Graphs in a 3D Environment.

Identifying spam link generators for monitoring emerging web spam.

Early Experience and Evaluation of File Systems on SSD with Database Applications.

Identifying spam link generators for monitoring emerging web spam.

E%2DARL An Economic incentive scheme for Adaptive Revenue%2DLoad%2Dbased dynamic replication of data in Mobile%2DP2P networks.

Duplicate%2DInsensitive Order Statistics Computation over Data Streams.
Abstract—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elements, many conventional aggregates computation problems need to be further investigated due to their duplication sensitive nature. In this paper, we present novel, space-efficient, one-scan algorithms to continuously maintain duplicate insensitive order sketches so that rank-based queries can be approximately processed with a relative rank error guarantee ǫ in the presence of data duplicates. Besides the space efficiency, the proposed algorithms are time-efficient and highly accurate. Moreover, our techniques may be immediately applied to the heavy hitter problem against distinct elements and to the existing fault-tolerant distributed communication techniques. A comprehensive performance study demonstrates that our algorithms can support real-time computation against high speed data streams.
Foreword.
reference set of international guidelines and recommendations for the reporting and presentation of statistical data and metadata. Although, the Handbook was prepared primarily for short-term economic statistics, many, if not most of the recommendations presented are also relevant for annual (structural) statistics and for social and population statistics. The Handbook draws heavily on existing international statistical guidelines and recommendations that have been developed over the last twenty years by international organisations and national statistical agencies. These international standards have been developed for implementation by international organisations themselves and by national agencies in both developed and developing economies. The need for the articulation of a comprehensive set of recommendations on the reporting and presentation of statistical data and metadata is one aspect of the overall demand for improved international comparability and consistency of statistics compiled and published by national agencies and international organisations. This requirement has itself been driven by closer economic and social linkages between both the 30 OECD Member countries and between those countries and large emerging non-member economies. As discussed in the Handbook, the major causes of differences in statistics compiled in different countries flow from the use of different definitions and concepts and
Efficient Analyzing General Dominant Relationship Based on Partial Order Models.

Detecting Hijacked Sites by Web Spammer Using Link%2DBased Algorithms.

Special Issue on Information Explosion.

Sharable file searching in unstructured Peer%2Dto%2Dpeer systems.

Finding Related Search Engine Queries by Web Community Based Query Enrichment.

A study of link farm distribution and evolution using a time series of web snapshots.

Evaluating Non%2DIn%2DPlace Update Techniques for Flash%2DBased Transaction Processing Systems.

Information Visualization and Organization for Participatory Monitoring of Invasive Alien Species.

Polynomial to Linear Efficient Classification with Conjunctive Features.

Keyword Search in Spatial Databases Towards Searching by Document.
Abstract — This work addresses a novel spatial keyword query called the m-closest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive
Detecting Link Hijacking by Web Spammers.

Enhancing Web Search by Aggregating Results of Related Web Queries.

A novel fault%2Dtolerant execution model by using of mobile agents.

An economic incentive model for encouraging peer collaboration in mobile%2DP2P networks with support for constraint queries.

Fast likelihood search for hidden Markov models.

Query%2DURL Bipartite Based Approach to Personalized Query Recommendation.
Query recommendation is considered an effective assistant in enhancing keyword based queries in search engines and Web search software. Conventional approach to query recommendation has been focused on query-term based analysis over the user access logs. In this paper, we argue that utilizing the connectivity of a query-URL bipartite graph to recommend relevant queries can significantly improve the accuracy and effectiveness of the conventional query-term based query recommendation systems. We refer to the Query-URL Bipartite based query reCommendation approach as QUBIC. The QUBIC approach has two unique characteristics. First, instead of operating on the original bipartite graph directly using biclique based approach or graph clustering, we extract an affinity graph of queries from the initial query-URL bipartite graph. The affinity graph consists of only queries as its vertices and its edges are weighted according to a query-URL vector based similarity (distance) measure. By utilizing the query affinity graph, we are able to capture the propagation of similarity from query to query by inducing an implicit topical relatedness between queries. We devise a novel rank mechanism for ordering the related queries based on the merging distances of a hierarchical agglomerative clustering. We compare our proposed ranking algorithm with both naïve ranking that uses the query-URL similarity measure directly, and the single-linkage based ranking method. In addition, we make it possible for users to interactively participate in the query recommendation process, to bridge the gap between the determinacy of actual similarity values and the indeterminacy of users ’ information needs, allowing the lists of related queries to be changed from user to user and query to query, thus personalizing the query recommendation on demand. The experimental results from two query collections demonstrate the effectiveness and feasibility of our approach. 1.
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation.

Structure of the Thai Web Graph.

Socio%2DSense A System for Analysing the Societal Behavior from Long Term Web Archive.

A Novel Chi2 Algorithm for Discretization of Continuous Attributes.

Connectivity of the Thai Web Graph.

Using Hidden Markov Random Fields to Combine Distributional and Pattern%2DBased Word Clustering.
Word clustering is a conventional and important NLP task, and the literature has suggested two kinds of approaches to this problem. One is based on the distributional similarity and the other relies on the co-occurrence of two words in lexicosyntactic patterns. Although the two methods have been discussed separately, it is promising to combine them since they are complementary with each other. This paper proposes to integrate them using hidden Markov random fields and demonstrates its effectiveness through experiments. 1
Query Recommendation Using Large%2DScale Web Access Logs and Web Page Archive.

EcoRare An Economic Incentive Scheme for Efficient Rare Data Accessibility in Mobile%2DP2P Networks.

Enhance Retrieval Efficiency on the Internet.
Washington • TokyoSeventh International Conference on Networking ICN 2008 Table of Contents Preface........................................................................................................................................................xiv
Storage fusion.
This paper presents the human-computer interaction in an automatic pool trainer currently being developed at the Center for PersonKommunikation, Aalborg University. The aim of the system is to automate (parts of) the learning process, in this case of the game of pool. The Automated Pool Trainer (APT) utilises multi modal, agent driven user-system communication, to facilitate the user interaction. To allow the user the necessary freedom of movement when addressing the task, system output is presented on a wall-mounted screen and is augmented by a laser drawing lines and points directly on the pool table surface. User Interaction is either carried out via a spoken dialogue with an animated interface agent, or by using a touch screen panel. The paper describes the philosophy on which the system is designed, as well as the system architecture and individual modules. The user interaction is described and the paper concludes with a presentation of some test results and a discussion of the suitability of the presented and similar systems. 1.
Characterization of the Thai hostgraph.

An optimal multimedia object allocation solution in transcoding%2Denabled wide%2Darea storage systems.

Characterization of the Thai hostgraph.

CoopIS 2008 PC Co%2Dchairs%27 Message.

Using Ontology%2DBased User Preferences to Aggregate Rank Lists in Web Search.

Power%2Daware Remote Replication for Enterprise%2Dlevel Disaster Recovery Systems.
Electric energy consumed in data centers is rapidly growing. Power-aware IT, recently called ‘green IT’, is widely recognized as a significant challenge. Disk storage is a non-negligible energy consumer. Rather, in light of recent data-intensive systems where a number of disk drives are incorporated, the disk storage may be what we must consider primarily. Yet, all of the disk drives are not used for primary datasets, but rather larger portion of them are utilized for storing a variety of copies such as backups and snapshots. Saving the energy of such storage resources that manage copies is a promising approach. The paper presents a power-aware disaster recovery system, in which the reflection of transferred updated information can be deferred through eager compaction technique. Great energy saving of storage systems is expected in the remote secondary site. Our experiments using a commercial database system show that 80-85 % energy of the secondary-site disk storage can be saved with small penalties of possible service breakdown time. 1
Editorial.
calls &amp; calendarEDITORIAL
Towards Efficient Dominant Relationship Exploration of the Product Items on the Web.

Aggregating User%2DCentered Rankings to Improve Web Search.

A Large%2DScale Study of Link Spam Detection by Graph Algorithms %28S%29.

Challenge for Info%2Dplosion.

Dynamic Adaptation Strategies for Long%2DTerm and Short%2DTerm User Profile to Personalize Search.

%27Socio Sense%27 and %27Cyber Infrastructure%27 for Information Explosion Era%27 Projects in Japan.

LAPIN Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases.

ABIDE A Bid%2DBased Economic Incentive Model for Enticing Non%2Dcooperative Peers in Mobile%2DP2P Networks.
Abstract. In mobile ad-hoc peer-to-peer (M-P2P) networks, a large percentage of the mobile peers typically do not provide any service to the network, thereby motivating incentive schemes for enticing non-cooperative mobile peers to provide service. We propose ABIDE, a novel bid-based economic incentive model for enticing non-cooperative mobile peers to provide service in M-P2P networks. The main contributions of ABIDE are three-fold. First, it encourages relay peers to act as brokers for performing value-added routing (i.e., pro-actively search for query results) due to bid-based incentives. Second, it integrates newly joined peers in the system seamlessly by sharing the loads with the neighbouring brokers. This helps the new peers to earn revenues in order to be able to obtain services. Third, it considers both effective data sharing and resource sharing among the peers. ABIDE also considers quality of service, load, energy and network topology. Our performance study indicates that ABIDE is indeed effective in increasing the number of serviceproviders in M-P2P networks, thereby improving query response times and data availability. 1
LEASE An Economic Approach to Leasing Data Items in Mobile%2DP2P Networks to Improve Data Availability.
Abstract. This work proposes LEASE, a novel Mobile-P2P lease-based economic incentive model, in which data requestors need to pay the price (in virtual currency) of their requested data items to data-providers. In LEASE, dataproviding mobile peers lease data items to free-riders, who do not have any data items to provide, in lieu of a lease payment. Thus, LEASE not only combats free-riding, but also entices free-riders to host data items, thereby improving network connectivity due to higher peer participation. In essence, LEASE facilitates the collaborative harnessing of limited mobile peer resources for improving data availability. Our performance study shows that LEASE indeed improves query response times and data availability in Mobile-P2P networks. 1
Challenge for Info%2Dplosion.

Building Lexicon for Sentiment Analysis from Massive Collection of HTML Documents.
Recognizing polarity requires a list of polar words and phrases. For the purpose of building such lexicon automatically, a lot of studies have investigated (semi-) unsupervised method of learning polarity of words and phrases. In this paper, we explore to use structural clues that can extract polar sentences from Japanese HTML documents, and build lexicon from the extracted polar sentences. The key idea is to develop the structural clues so that it achieves extremely high precision at the cost of recall. In order to compensate for the low recall, we used massive collection of HTML documents. Thus, we could prepare enough polar sentence corpus. 1
User%2Dassisted similarity estimation for searching related web pages.

Online Monitoring of Database Structural Deterioration.

An Efficient Method for Improving Data Collection Precision in Lifetime%2Dadaptive Wireless Sensor Networks.

Summarizing Order Statistics over Data Streams with Duplicates.
A rank query is essentially to find a data element with a given rank against a monotonic order specified on data elements. Rank queries have several equivalent variations
Analysis of iSCSI short blocks access.

Performance analysis on mobile agent%2Dbased parallel information retrieval approaches.

ConQuer A Peer Group%2DBased Incentive Model for Constraint Querying in Mobile%2DP2P Networks.
Abstract — In mobile ad-hoc peer-to-peer (M-P2P) networks, economic models become a necessity for enticing non-cooperative mobile peers to provide service. M-P2P users may issue queries with varying constraints on query response time, data quality of results and trustworthiness of the data source. This work proposes ConQuer, which addresses constraint queries in economybased M-P2P networks. ConQuer proposes a broker-based incentive M-P2P model for handling user-defined constraint queries. It also provides incentives for MPs to form collaborative peer groups for maximizing data availability and revenues by mutually allocating and deallocating data items using a royalty-based revenue-sharing method. Such reallocations facilitate MPs in providing better data quality, thereby allowing them to further increase their revenues. Keywords: Economic model, Mobile-P2P networks, Royalty model, data allocation, free-riding.
General dominant relationship analysis based on partial order models.

Towards efficient dominant relationship exploration of the product items on the web.

Editorial.
calls &amp; calendarEDITORIAL
An optimal solution for caching multimedia objects in transcoding proxies.

Distribution of mobile agents in vulnerable networks.

A method for language%2Dspecific Web crawling and its evaluation.

Frontiers of WWW Research and Development %2D APWeb 2006

Advances in Knowledge Discovery and Data Mining

CLEAR An Efficient Context and Location%2DBased Dynamic Replication Scheme for Mobile%2DP2P Networks.
Abstract. We propose CLEAR (Context and Location-based Efficient Allocation of Replicas), a dynamic replica allocation scheme for improving data availability in mobile ad-hoc peer-to-peer (M-P2P) networks. CLEAR exploits user mobility patterns and deploys a super-peer architecture to manage replica allocation efficiently. CLEAR avoids broadcast storm during replica allocation and eliminates the need for broadcastbased querying. CLEAR considers different levels of replica consistency and load as replica allocation criteria. Our performance study indicates CLEAR’s effectiveness in improving data availability in M-P2P networks. 1
Advances in Web%2DAge Information Management

Automatic Construction of Polarity%2DTagged Corpus from HTML Documents.
This paper proposes a novel method of building polarity-tagged corpus from HTML documents. The characteristics of this method is that it is fully automatic and can be applied to arbitrary HTML documents. The idea behind our method is to utilize certain layout structures and linguistic pattern. By using them, we can automatically extract such sentences that express opinion. In our experiment, the method could construct a corpus consisting of 126,610 sentences. 1
An Effective System for Mining Web Log.
Most of the organizations put information on the web because they want it to be seen by the world. Their goal is to have visitors come to the site, feel comfortable and stay a while and try to know completely about the running organization. As educational system increasingly requires data mining, the opportunity arises to mine the resulting large amounts of student information for hidden useful information (patterns like rule, clustering, and classification, etc). The education domain offers ground for many interesting and challenging data mining applications like astronomy, chemistry, engineering, climate studies, geology, oceanography, ecology, physics, biology, health sciences and computer science. Collecting the interesting patterns using the required interestingness measures, which help us in discovering the sophisticated patterns that are ultimately used for developing the site. We study the application of data mining to educational log data collected from Guru Nanak Institute of Technology, Ibrahimpatnam, India. We have proposed a custom-built apriori algorithm to find the effective pattern analysis. Finally, analyzing web logs for usage and access trends can not only provide important information to web site developers and administrators, but also help in creating adaptive web sites.
EcoRep An Economic Model for efficient dynamic replication in Mobile%2DP2P networks.
In mobile ad-hoc peer-to-peer (M-P2P) networks, frequent network partitioning leads to typically low data availability, thereby making data replication a necessity. This work proposes EcoRep, a novel economic model for dynamic replica allocation in M-P2P networks. EcoRep performs replica allocation based on a data item’s relative importance, which is quantified by the data item’s price in terms of a virtual currency. The price of a data item depends on its access frequency, the number of users who accessed it, the number of its existing replicas, its (replica) consistency and the average response time required for accessing it. EcoRep ensures fair replica allocation by considering the origin of queries for data items. EcoRep requires a query issuing user to pay the price of his requested data item to the user serving his request. This discourages free-riding and encourages user participation by providing an incentive for users to become service-providers. EcoRep also considers other issues such as load, energy and network topology as replication criteria. Our performance study indicates that EcoRep is indeed effective in improving query response times and data availability in M-P2P networks. 1
CLEAR An Efficient Context and Location%2DBased Dynamic Replication Scheme for Mobile%2DP2P Networks.
Abstract. We propose CLEAR (Context and Location-based Efficient Allocation of Replicas), a dynamic replica allocation scheme for improving data availability in mobile ad-hoc peer-to-peer (M-P2P) networks. CLEAR exploits user mobility patterns and deploys a super-peer architecture to manage replica allocation efficiently. CLEAR avoids broadcast storm during replica allocation and eliminates the need for broadcastbased querying. CLEAR considers different levels of replica consistency and load as replica allocation criteria. Our performance study indicates CLEAR’s effectiveness in improving data availability in M-P2P networks. 1
Clustering of Search Engine Keywords Using Access Logs.

Privacy%2C Security and Trust in P2P environments A Perspective.
The Peer-to-Peer (P2P) paradigm of computing has been growing dramatically in popularity over the last decade. Consequently, large amounts of data are being shared among P2P users on a global-scale. Given the inherently untrustworthy nature of P2P networks, this paper provides a perspective concerning trust, privacy and security issues in P2P networks. Additionally, we discuss the applicability of the P2P paradigm to new application domains, the aim being to ensure that the power of the P2P paradigm goes well beyond P2P file-sharing interactions. 1.
IdentifyingWeb Spam by Densely Connected Sites and its Statistics in a JapaneseWeb Snapshot.

Finding Thai Web Pages in Foreign Web Spaces.

PAID Mining Sequential Patterns by Passed Item Deduction in Large Databases.

CADRE A Collaborative replica allocation and deallocation approach for Mobile%2DP2P networks.

CADRE A Collaborative replica allocation and deallocation approach for Mobile%2DP2P networks.

An Execution Prototype of Mobile Agent%2DBased Peer%2Dto%2DPeer Systems.

What%27s really new on the web%3F identifying new pages from a series of unstable web snapshots.
Identifying and tracking new information on the Web is important in sociology, marketing, and survey research, since new trends might be apparent in the new information. Such changes can be observed by crawling the Web periodically. In practice, however, it is impossible to crawl the entire expanding Web repeatedly. This means that the novelty of a page remains unknown, even if that page did not exist in previous snapshots. In this paper, we propose a novelty measure for estimating the certainty that a newly crawled page appeared between the previous and current crawls. Using this novelty measure, new pages can be extracted from a series of unstable snapshots for further analysis and mining to identify new trends on the Web. We evaluated the precision, recall, and miss rate of the novelty measure using our Japanese web archive, and applied it to a Web archive search engine.
Supporting Colocated Interactions Using RFID and Social Network Displays.

Efficient%2C Energy Conserving Transaction Processing in Wireless Data Broadcast.
Abstract—Broadcasting in wireless mobile computing environments is an effective technique to disseminate information to a massive number of clients equipped with powerful, battery operated devices. To conserve the usage of energy, which is a scarce resource, the information to be broadcast must be organized so that the client can selectively tune in at the desired portion of the broadcast. In this paper, the efficient, energy conserving transaction processing in mobile broadcast environments is examined with widely accepted approaches to indexed data organizations suited for a single item retrieval. The basic idea is to share the index information on multiple data items based on the predeclaration technique. The analytical and simulation studies have been performed to evaluate the effectiveness of our methodology, showing that predeclaration-based transaction processing with selective tuning ability can provide a significant performance improvement of battery life, while retaining a low access time. Tolerance to access failures during transaction processing is also described. Index Terms—Mobile computing, wireless data broadcast, access methods, indexing methods, performance evaluation. 1
Web Information Systems Engineering %2D WISE 2005
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family of web ontology languages based on description logic, has been proposed for the Semantic Web. Answering a query over the SemanticWeb is thus not trivial, but a deductive process. However, the reasoning on OWL with data has an efficiency problem. Thus, we introduce optimization techniques for the inference algorithm. This work demonstrates the techniques for instance checking and instance retrieval problems with respect to ALC description logic which covers certain parts of OWL. 1
A Self%2DAdaptive Model to Improve Average Response Time of Multiple%2DEvent Filtering for Pub%2FSub System.

Trace System of iSCSI Storage Access and Performance Improvement.

Dimension Transform Based Efficient Event Filtering for Symmetric Publish%2FSubscribe System.

Effective Dynamic Replication in Wide%2DArea Network Environments A Perspective.

Development of a Data Mining Application for Huge Scale Earth Environmental Data Archives.

iSCSI Analysis System and Performance Improvement of iSCSI Sequential Access in High Latency Networks.

A system for visualizing and analyzing the evolution of the web with a time series of graphs.
We propose WebRelievo, a system for visualizing and analyzing the evolution of the web structure based on a large Web archive with a series of snapshots. It visualizes the evolution with a time series of graphs, in which nodes are web pages, and edges are relationships between pages. Graphs can be clustered to show the overview of changes in graphs. WebRelievo aligns these graphs according to their time, and automatically determines their layout keeping positions of nodes synchronized over time, so that the user can keep track pages and clusters. This visualization enables us to understand when pages appeared, how their relationships have evolved, and how clusters are merged and split over time. Current implementation of WebRelievo is based on six Japanese web archives crawled from 1999 to 2003. The user can interactively browse those graphs by changing the focused page and by changing layouts of graphs. Using WebRelievo we can answer historical questions, and to investigate changes in trends on the Web. We show the feasibility of WebRelievo by applying it to tracking trends in P2P systems and search engines for mobile phones, and to investigating link spamming.
A Study on Performance Analysis of Structural Deterioration for RDBMS.

LAPIN%2DSPAM An Improved Algorithm for Mining Sequential Pattern.

Simulation Study of Language Specific Web Crawling.

kNR%2Dtree a novel R%2Dtree%2Dbased index for facilitating spatial window queries on any k relations among N spatial relations in mobile environments.
novel R-tree-based index for facilitating
Geo%2Dword centric association rule mining.

Trace System of iSCSI Storage Access.

UB%2DTree Based Efficient Predicate Index with Dimension Transform for Pub%2FSub System.

On Improving the Performance Dependability of Unstructured P2P Systems via Replication.
Abstract. The ever-increasing popularity of peer-to-peer (P2P) systems provides a strong motivation for designing a dependable P2P system. Dependability in P2P systems can be viewed from two different perspectives, namely system reliability (the availability of the individual peers) and system performance (data availability).This paper looks at dependability from the viewpoint of system performance and aims at enhancing the dependability of unstructured P2P systems via dynamic replication, while taking into account the disproportionately large number of ‘free riders ’ that characterize P2P systems.Notably, the sheer size of P2P networks and the inherent heterogeneity and dynamism of the environment pose significant challenges to the improvement of dependability in P2P systems.The main contributions of our proposal are two-fold.First, we propose a dynamic data placement strategy involving data replication, the objective being to reduce the loads of the overloaded peers. Second, we present a dynamic query redirection technique which aims at reducing response times.Our performance evaluation demonstrates that our proposed technique is indeed effective in improving user response times significantly, thereby increasing the dependability of P2P systems. 1
Extracting User Behavior by Web Communities Technology on Global Web Logs.
Abstract. A lot of work has been done on extracting the model of web user behavior. Most of them target server-side logs that cannot track user behavior outside of the server. Recently, a novel way has been developed to collect web browsing histories, using the same method for determining TV audience ratings; i.e., by collecting data from randomly selected users called panels. The logs collected from panels(called panel logs) cover an extremely broad URL-space, and it is difficult to capture the global behaviors of the users. Here we utilize mining results of web community to group those URLs into easily understandable topics. We
FP%2Dtax tree structure based generalized association rule mining.
Data mining has been widely recognized as a powerful tool to explore added value from large-scale databases. One of data mining techniques, generalized association rule mining with taxonomy, is potential to discover more useful knowledge than ordinary flat association rule mining by taking application specific information into account. We propose pattern growth mining paradigm based FP-tax algorithm, which employs a tree structure to compress the database. Two methods to traverse the tree structure are examined: Bottom-Up and Top-Down. Experimental results show that both methods significantly outperform classic Cumulate algorithm, in particular Top-Down FP-tax can achieve two order of magnitudes better performance than Cumulate.
P2PR%2DTree An R%2DTree%2DBased Spatial Index for Peer%2Dto%2DPeer Environments.
Abstract. The unprecedented growth and increased importance of geographically distributed spatial data has created a strong need for efficient sharing of such data. Interestingly, the ever-increasing popularity of peer-to-peer (P2P) systems has opened exciting possibilities for such sharing. This motivates our investigation into spatial indexing in P2P systems. While much work has been done towards expediting search in file-sharing P2P systems, issues concerning spatial indexing in P2P systems are significantly more complicated due to overlaps between spatial objects and the complexity of spatial queries. Incidentally, existing Rtree-based structures for distributed environments (e.g., the MC-Rtree) are not adequate for addressing the sheer scale, dynamism and heterogeneity of P2P environments. Hence, we propose the P2PR-tree (Peerto-Peer R-tree), which is a new spatial indexspecifically designed for P2P systems. The main features of P2PR-tree are two-fold. First, it is hierarchical and performs efficient pruning of the search space by maintaining minimal amount of information concerning peers that are far away and storing more information concerning nearby peers, thereby optimizing disk space usage. Second, it is completely decentralized, scalable and robust to peers joining/leaving the system. The results of our performance evaluation demonstrate that it is indeed practically feasible to share spatial data in a P2P system and that P2PR-tree is able to outperform MC-Rtree significantly. Keywords: Spatial indexing, P2P systems, R-tree, scale, dynamism. 1
Load%2DBalancing Remote Spatial Join Queries in a Spatial GRID.

Visualization of Global Web Log and Web Communities.

Design of B Tree%2DBased Predicate Index for Efficient Event Matching.

TCDE Election Result.
is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters, conference information, and news should be
Speculative Locking Protocols to Improve Performance for Distributed Database System.

Design of B Tree%2DBased Predicate Index for Efficient Event Matching.

Finding a Web Community by Maximum Flow Algorithm with HITS Score Based Capacity.

PC Cluster Based Parallel Frequent Pattern Mining and Parallel Web Access Pattern Mining.

Effective Load%2DBalancing via Migration and Replication in Spatial Grids.
The unprecedented growth as well as the growing importance of available spatial data at geographically distributed locations has made efficient networking of such data a necessity for availability reasons. The emergence of grid computing coupled with large and powerful computer networks, which have the capability to connect thousands of geographically distributed computers worldwide, has opened a world of opportunities for such networking. This provides a strong motivation for designing a spatial grid which supports fast data retrieval and allows its users to transparently access data of any location from anywhere. However, several challenging issues need to be addressed for the spatial grid to work efficiently in practice. In particular, mechanisms for efficient search and effective load-balancing need to be in place. This paper focusses on dynamic load-balancing in spatial grids via data migration/replication to prevent degradation in system performance owing to severe load imbalance among the nodes. Notably, issues concerning load-balancing are more complex in case of grids than for traditional domains primarily because a grid usually spans across multiple administrative domains. The main contributions of our...
Tree Structure Based Parallel Frequent Pattern Mining on PC Cluster.

Finding Neighbor Communities in the Web Using Inter%2Dsite Graph.
In recent years, link-based information retrieval methods  from the Web are developed. A framework of these methods is a Web  graph using pages as vertices and Web-links as edges. In the last year,  the authors have claimed that an inter-site graph using sites as vertices  and global-links (links between sites) as edges is more natural and useful  as a framework for link-based information retrieval than a Web graph.
PC Cluster Based Parallel Frequent Pattern Mining and Parallel Web Access Pattern Mining.

Extracting evolution of web communities from a series of web archives.
store a series of large Web archives. It is now an exciting challenge for us to observe evolution of the Web. In this paper, we propose a method for observing evolution of web communities. A web community is a set of web pages created by individuals or associations with a common interest on a topic. So far, various link analysis techniques have been developed to extract web communities. We analyze evolution of web communities by comparing four Japanese web archives crawled from 1999 to 2002. Statistics of these archives and community evolution are examined, and the global behavior of evolution is described. Several metrics are introduced to measure the degree of web community evolution, such as growth rate, novelty, and stability. We developed a system for extracting detailed evolution of communities using these metrics. It allows us to understand when and how communities emerged and evolved. Some evolution examples are shown using our system.
Parallel Web Access Pattern Mining on PC Cluster.

Parallel FP%2DGrowth on PC Cluster.

Compact Encoding of the Web Graph Exploiting Various Power Laws Statistical Reason Behind Link Database.

Analyzing Global Behavior of Web Community Evolution.

Nominations for Chair of TCDE.
XML is fast becoming the intergalactic data speak alphabet for data and information exchange that hides the heterogeneity among the components of Loosely-coupled, distributed systems and provides the glue that allows the individual components to take part in the loosely integrated system. Since much of this data is currently stored in relational database systems, simplifying the transformation of this data from and to XML in general and from and to the agreed upon exchange schema specifically is an important feature that should improve the productivity of the programmer and the efficiency of this process. This article provides an overview over the features that are needed to provide access via HTTP and XML and presents the approach taken in Microsoft SQL Server.  Keywords: Loosely-coupled, distributed system architectures, XML, relational database systems  1 
Using Predeclaration for Efficient Read%2DOnly Transaction Processing in Wireless Data Broadcast.
Wireless data broadcast allows a large number of users to retrieve data simultaneously in mobile databases, resulting in an efficient way of using the scarce wireless bandwidth. The efficiency of data access methods, however, is limited by an inherent property that data can only be accessed strictly sequential by users. This paper addresses the issue of ensuring consistency and currency of data items requested in a certain order by wireless read-only transactions. To properly cope with the inherent property of data broadcast, we explore a predeclaration-based query optimization and devise three predeclaration-based transaction processing methods.
Reducing the blocking in two%2Dphase commit with backup sites.

Dynamic Multi%2DResolution Spatial Object Derivation for Mobile and WWW Applications.

WEB Community Mining and WEB Log Mining Commodity Cluster Based Execution.
The emergence of WWW has drawn new frontiers for database research. Web mining has become a hot topic since WWW rapid expansion rate and chaotic nature have exposed some technical challenges as well as interesting discoveries. In general web mining can be classified into web structure mining and web usage mining. Here we introduce two applications of web mining, first from mining the web structure we identify web communities, and the second we mine web usage of mobile internet users on location aware search engine. Those applications require heavy computational power as well as good scalability. Cluster of commodity PCs is suitable as the platform to handle such applications. Here we also report some approaches for optimal parallel execution of mining algorithms on PC cluster.
Evaluating contents%2Dlink coupled web page clustering for web search results.

Run%2DTime Load Balancing System on SAN%2Dconnected PC Cluster for Dynamic Injection of CPU and Disk Resource %2D A Case Study of Data Mining Application.

On Combining Link and Contents Information for Web Page Clustering.

Some Experiences on Large Scale Web Mining.

A Graph Based Approach to Extract a Neighborhood Customer Community for Collaborative Filtering.

Using Predeclaration for Efficient Read%2Donly Transaction Processing in Wireless Data Broadcast.
Wireless data broadcast allows a large number of users to retrieve data simultaneously in mobile databases, resulting in an efficient way of using the scarce wireless bandwidth. The efficiency of data access methods, however, is limited by an inherent property that data can only be accessed strictly sequential by users. This paper addresses the issue of ensuring consistency and currency of data items requested in a certain order by wireless read-only transactions. To properly cope with the inherent property of data broadcast, we explore a predeclaration-based query optimization and devise three predeclaration-based transaction processing methods.
Runtime Data Declustering over SAN%2DConnected PC Cluster System.

Focusing on Sites in the Web.

User Behavior Analysis of Location Aware Search Engine.
Rapid growth of internet access from mobile users puts much importance on location specific information on the web. An unique web service called Mobile Info Search (MIS) from NTT Laboratories gathers the information and provide location aware search facilities. We performed association rule mining and sequence pattern mining against the access log which was accumulated at the MIS site in order to get some insight into the behavior of mobile users regarding the spatial information on the web. Detail web log mining process and the rules we derived are reported in this paper.
Naviz  Website Navigational Behavior Visualizer.
Navigational behavior of website visitors can be extracted from web access log files with data mining  techniques such as sequential pattern mining. Visualization of the discovered patterns is very helpful  to understand how visitors navigate over the various pages on the site. Currently several web log  visualization tools have been developed. However those tools are far from satisfactory. They do not  provide global view of visitor access as well as individual traversal path effectively. Here we  introduce Naviz, a system of interactive web log visualization that is designed to overcome those  drawbacks. It combines two-dimensional graph of visitor access traversals that considers appropriate  web traversal properties, i.e. hierarchization regarding traversal traffic and grouping of related pages,  and facilities for filtering traversal paths by specifying visited pages and path attributes, such as  number of hops, support and confidence. The tool also provides support for modem dynamic web  pages. We apply the tool to visualize results of data mining study on web log data of Mobile  Townpage, a directory service of phone numbers in Japan for i-Mode mobile intemet users. The  results indicate that our system can easily handle thousands of discovered patterns to discover  interesting navigational behavior such as success paths, exit paths and lost paths.
Efficient Processing of Wireless Read%2Donly Transactions in Data Broadcast.
In this paper, we address the issue of ensuring consistency of multiple data items requested in a certain order by read-only transactions in wireless data broadcast. To handle the inherent property in a data broadcast environment that data can only be accessed strictly sequential by users, we explore a predeclaration-based query optimization and devise two practical transaction processing methods in the context of local caching. We also evaluate the performance of the proposed methods by an analytical study. Evaluation results show that the predeclaration technique we introduce reduces response time significantly and adapts to dynamic changes in workload.
Experiments on Query Expansion for Internet Yellow Page Services Using Web Log Mining.
1
Web%2DLinkage Viewer Finding Graph Structures in the Web.

Effects of maximum flow algorithm on identifying web community.


Database Support for Spatial Generalisation for WWW and Mobile Applications.

Applying the Site Information to the Information Retrieval from the Web.
In recent years, several information retrieval methods using information about the Web-links are developed, such as HITS and Trawling. In order to analyze the Web-links dividing into links inside each Web site (local-links) and links between Web sites (global-links) for the information retrieval, it is required that a proper model of the Web site, a phrase used ambiguously in daily life. In the existing researches, a Web server is used as a model of the Web site. This idea works relatively well in case that a Web site corresponds to a server such as public Web sites, but works poorly in case that multiple Web sites correspond to a server such as private Web sites on rental Web servers. In this paper, we propose a new model of the Web site, &#034;directorybased site&#034; to handle typical private sites, and a method to identify them using information about the URL and the Web-links. We verify the method can approximately identify about ### of over 110 thousands servers whether each server has multiple directory-based sites or not, and extract over 500 thousands of directory-based sites and 4 million global-links by computational experiments using jp- domain URLs and Web-links data contains over 23 million URLs and 100 million Web-links, collected from July to August 2000, by Toyoda and Kitsuregawa. We also propose a new framework of the Web-links based information retrieval that uses the directory-based sites and the globallinks instead of the Web pages and the whole Web-links respectively, and examine effectiveness of our framework by comparing a result of Trawling on our framework to one on the existing framework.
R%2Dtree%2Dbased Data Migration and Selv%2DTuning Strategies in Shared%2DNothing Spatial Databases.

RING A Strategy for Minimizing the Cost of Online Data Placement Reorganization for Btree Indexed Database over Shared%2Dnothing Machines.

Web Mining Is Parallel.
This paper 1 presents an empirical approach to mining parallel corpora. Conventional approaches use a readily available collection of comparable, nonparallel corpora to extract parallel sentences. This paper attempts the much more challenging task of directly searching for high-quality sentence pairs from the Web. We tackle the problem by formulating good search query using „Learning to Rank ‟ and by filtering noisy document pairs using IBM Model 1 alignment. End-to-end evaluation shows that the proposed approach significantly improves the performance of statistical machine translation. 1
Creating a Web community chart for navigating related communities.
numerous web communities on the Web. A web community is a collection of web pages created by individuals or any kind of associations that have a common interest on a specific topic. In this paper, we propose a technique to create a web community chart, that connects related web communities, from thousands of seed pages. This allows the user to navigate through related web communities, and can be used for a `What&#039;s Related Community&#039; service that provides not only the web community including a given page but also related web communities. Our technique is based on a related page algorithm that gives related pages to a given page using only link analysis. We show that the algorithm can be used for creating the chart by applying the algorithm to each seed, then using similarities of the results to classify seeds into clusters and to deduce their relationships. We perform experiments to create a web community chart of companies and organizations from thousands of seed pages. First, we improve the precision of an existing related page algorithm, Companion, and evaluated the improved version, Companion--, by an user study. Then the chart is created using Companion--. The result chart consists of web communities including related pages, and paths between related web communities. From the chart, we can find many web communities of companies classified by their category of business, and relationships between the communities.
Development of an earth environmental digital library system for soil and land%2Datmospheric data.

Query Optimization for Vector Space Problems.
We present performance measurement results for a parallel SQL based information retrieval system implemented on a PC cluster system. We used the Web-TREC under a left-deep query execution plan. We achieved satisfactory  speed up.

Use Link%2DBased Clustering to Improve Web Search Results.

An Approach to Relate the Web Communities through Bipartite Graphs.
The Web harbors a large number of community structures. Early detection of community structures has many purposes such as reliable searching and selective advertising. In this paper we investigate the problem of extracting and relating the web community structures from a large collection of Web-pages by performing hyper-link analysis. The proposed algorithm extracts the potential community signatures by extracting the corresponding dense bipartite graph (DBG) structures from the given data set of web pages. Further, the proposed algorithm can also be used to relate the extracted community signatures. We report the experimental results conducted on 10 GB TREC (Text REtrieval Conference) data collection that contains 1.7 million pages and 21.5 million links. The results demonstrate that the proposed approach extracts meaningful community signatures and relates them.
A Web Community Chart for Navigating Related Communities.
numerous web communities on the Web. A web community is a collection of web pages created by individuals or any kind of associations that have a common interest on a specific topic. In this paper, we propose a technique to create a web community chart, that connects related web communities, from thousands of seed pages. This allows the user to navigate through related web communities, and can be used for a `What&#039;s Related Community&#039; service that provides not only the web community including a given page but also related web communities. Our technique is based on a related page algorithm that gives related pages to a given page using only link analysis. We show that the algorithm can be used for creating the chart by applying the algorithm to each seed, then using similarities of the results to classify seeds into clusters and to deduce their relationships. We perform experiments to create a web community chart of companies and organizations from thousands of seed pages. First, we improve the precision of an existing related page algorithm, Companion, and evaluated the improved version, Companion--, by an user study. Then the chart is created using Companion--. The result chart consists of web communities including related pages, and paths between related web communities. From the chart, we can find many web communities of companies classified by their category of business, and relationships between the communities.
Nominations for Chair of TCDE.
XML is fast becoming the intergalactic data speak alphabet for data and information exchange that hides the heterogeneity among the components of Loosely-coupled, distributed systems and provides the glue that allows the individual components to take part in the loosely integrated system. Since much of this data is currently stored in relational database systems, simplifying the transformation of this data from and to XML in general and from and to the agreed upon exchange schema specifically is an important feature that should improve the productivity of the programmer and the efficiency of this process. This article provides an overview over the features that are needed to provide access via HTTP and XML and presents the approach taken in Microsoft SQL Server.  Keywords: Loosely-coupled, distributed system architectures, XML, relational database systems  1 
New TCDE Chair for 2002%2D2003.

High Performance Computing
In the last three decades a large number of compiler transformations for optimizing programs have been implemented. Most optimization for uniprocessors reduce the number of instructions executed by the program using transformations based on the analysis of scalar quantities and data-flow techniques. In contrast, optimization for
A Fast Convergence Technique for Online Heat%2DBalancing of Btree Indexed Database over Shared%2DNothing Parallel Systems.

Web Log Mining and Parallel SQL Based Execution.

Blocking Reduction in Two%2Dphase Commit Protocol with Multiple Backup Sites.

SQL Based Association Rule Mining Using Commercial RDBMS %28IBM DB2 UBD EEE%29.

Speculation Based Nested Locking Protocol to Increase the Concurrency of Nested Transactions.

Using Available Remote Memory Dynamically for Parallel Data Mining Application on ATM%2DConnected PC Cluster.

Parallel Data Mining on ATM%2DConnected PC Cluster and Optimization of Its Execution Environments.
In this paper, wehave constructed a large scale ATM-connected PC cluster consists of 100 PCs, implemented a data mining application, and optimized its execution environment. Default parameters of TCP retransmission mechanism cannot provide good performance for data mining application, since a lot of collisions occur in the case of all-to-all multicasting in the large scale PC cluster. Using a TCP retransmission parameters according to the proposed parameter optimization, reasonably good performance improvementisachieved for parallel data mining on 100 PCs. Association rule mining, one of the best-known problems in data mining, differs from conventional scientific calculations in its usage of main memory.Wehaveinvestigated the feasibility of using available memory on remote nodes as a swap area when working nodes need to swap out their real memory contents. According to the experimental results on our PC cluster, the proposed method is expected to be considerably better than using hard disks as a swapping device.
Development of an Earth Envirnmental Digital Library System for Soil and Land%2DAtmosphere Data.

Towards Self%2DTuning Data Placement in Parallel Database Systems.
Parallel database systems are increasingly being deployed to support the performance demands of end-users. While declustering data across multiple nodes facilitates parallelism, existing data placement may no longer be optimal due to skewed workloads and changing access patterns. To prevent performance degradation, the placement of data must be reorganized, and this must be done on-line to minimize disruption to the system. In this paper, we consider a dynamic self-tuning approach to reorganization in a shared nothing system. We introduce a new index-based method that faciliates fast and e#- cient migration of data. Our solution incorporates a globally height-balanced structure and load tracking at di#erent levels of granularity. We conducted an extensive performance study, and implemented the methods on the Fujitsu AP3000 machine. Both the simulation and empirical results demonstrate that our proposed method is indeed scalable and e#ective in correcting any deterioration in system throughput. 1.
Parallel Data Mining on Large Scale PC Cluster.
The emergence of WWW has drawn new frontiers for database research. Web mining has become a hot topic since WWW rapid expansion rate and chaotic nature have exposed some technical challenges as well as interesting discoveries. In general web mining can be classified into web structure mining and web usage mining. Here we introduce two applications of web mining, first from mining the web structure we identify web communities, and the second we mine web usage of mobile internet users on location aware search engine. Those applications require heavy computational power as well as good scalability. Cluster of commodity PCs is suitable as the platform to handle such applications. Here we also report some approaches for optimal parallel execution of mining algorithms on PC cluster.
Optimizing transport protocol parameters for large scale PC cluster and its evaluation with parallel data mining.

Guest Editors%27 Introduction %2D Papers from ICDE 1999.

SIGMOD Sister Societies.

Load balancing algorithm using tape migration mechanisms for scalable tape archiver and its performance evaluation.

Development of an Earth Environmental Database System which Interacts with Application Software.
With increasing interest in earth environmental issues, earth environmental database system that can solve various types of relevant data is high demand. While currently available databases are accessible by the Internet and enable users to acquire and observe data, they lack the interactive functions that are important to most applications such as simulation to predict future earth environmental phenomena. Our research is therefore geared to the development of an earth environmental database which interacts with application software. The goal is a database which stores not only input data but result data and its parameters, creating a unified database. In other words, the ability to manage both kinds of data makes the database more suitable for simulation applications.
Parallel R%2DTree Spatial Join for a Shared%2DNothing Architecture.
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This paper proposes a Replicated Parallel Packed R-tree and its use in performing the parallel R-tree join. We examine performance using the Digital Chart of the World Data on a shared nothing machine. Our experimental results show that the proposed tree and heuristics for load balancing improve Parallel R-tree join.  1 Introduction  The past two decades have seen an explosive growth in the use of spatial data in various fields like Earth Sciences, cartography, remote sensing, car navigation systems and land information systems. Data sets in such areas are characterized by large size (sometimes of the order of terabytes). Spatial databases also support data structures like points, lines and polygons. Storing, managing and manipulating such data is more expensive in comparison to ordinary business applications, sin...
A Dynamic Load Balancing Strategy for Parallel Datacube Computation.
important applications in the database industry. In particular, the datacube operation proposed in [5] receives strong attention among researchers as a fundamental research topic in the OLAP technologies. The datacube operation requires computation of aggregations on all possible combinations of each dimension attribute. As the number of dimensions increases, it becomes very expensive to compute datacubes, because the required computation cost grows exponentially with the increase of dimensions. Parallelization is very important factor for fast datacube computation. However, we cannot obtain sufficient performance gain in the presence of data skew even if the computation is parallelized. In this paper, we present a dynamic load balancing strategy, which enables us to extract the effectiveness of parallizing datacube computation sufficiently. We perform experiments based on simulations and show that our strategy performs well.
Mining Generalized Association Rule Using Parallel RDB Engine on PC Cluster.

Performance Analysis for Parallel Generalized Association Rule Mining on a Large Scale PC Cluster.

Dynamic Remote Memory Acquiring for Parallel Data Mining on PC Cluster Prliminary Performance Results.

Scalable Protocols for the Internet to Reduce Service Time and Server Load.

Satellite Imagery Archive System and its Usage Analysis at IIS

Dynamic remote memory acquisition for parallel data mining on ATM%2Dconnected PC cluster.

Dynamic remote memory acquisition for parallel data mining on ATM%2Dconnected PC cluster.

Parallel Generalized Association Rule Mining on Large Scale PC Cluster.

Speculative Lock Management to Increase Concurrency in Mobile Environments.

Parallel SQL Based Association Rule Mining on Large Scale PC Cluster Performance Comparison with Directly Coded C Implementation.

Dynamic Romote Memory Utilization on an ATM%2DConnected PC Cluster for a Data Mining Application.

Dynamic Load Balancing for Parallel Association Rule Mining on Heterogenous PC Cluster Systems.

Implementation of tertiary storage file system with partial migration mechanism on an 8 mm tape archiver and its performance evaluation.

Reducing the Blocking in Two%2DPhase Commit Protocol Employing Backup Sites.
In distributed data base systems (DDBSs), a transaction blocks during two-phase commit (2PC) processing if the coordinator site fails and at the same time some participant site has declared itself ready to commit the transaction. The blocking phenomena reduces availability of the system since the blocked transactions keep all the resources until they receive the final command from the coordinator after its recovery. To remove the blocking problem in 2PC protocol, three phase commit (3PC) protocol was proposed. Although 3PC protocol eliminates the blocking problem, it involves an extra round of message transmission, which further degrades the performance of DDBSs. In this paper, we propose a backup commit (BC) protocol by including backup phase to 2PC protocol. In this, one backup site is attached to each coordinator site. After receiving responses from all participants in the first phase, the coordinator communicates its decision only to its backup site in the backup phase. Afterwards, it sends final decision to participants. When blocking occurs due to the failure of the coordinator site, the participant sites consult coordinator&#039;s backup site and follow termination protocols. In this way, BC protocol achieves non-blocking property in most of the coordinator site failures. However, in the worst case, the blocking can occur in BC protocol when both the coordinator and its backup site fail simultaneously. If such a rare case occurs, the participants wait until the recovery of either the coordinator site or the backup site. BC protocol suits best for DDBS environments in which sites fail frequently and messages take longer delivery time. Through simulation experiments it has been shown that BC protocol exhibits superior throughput and response time performance over 3PC pr...
Improving Main Memory Utilization for Array%2DBased DataCube Computation.

Optimizing Protocol Parameters to Large Scale PC Cluster and Evaluation of its Effectiveness with Parallel Data Mining.

Performance Analysis of Parallel Hash Join Algorithms on a Distributed Shared Memory Machine Implementation and Evaluation on HP Exemplar SPP 1600.

Mining Algorithms for Sequential Patterns in Parallel Hash Based Approach.
In this paper, we study the problem of mining sequential patterns in a large database of customer transactions. Since finding sequential patterns has to handle a large amount of customer transaction data and requires multiple passes over the database, it is expected that parallel algorithms help to improve the performance significantly. We consider the parallel algorithms for mining sequential patterns on a shared-nothing environment. Three parallel algorithms (Non Partitioned Sequential Pattern Mining(NPSPM), Simply Partitioned Sequential Pattern Mining(SPSPM) and Hash Partitioned Sequential Pattern Mining (HPSPM)) are proposed. In NPSPM, the candidate sequences are just copied among all the nodes, which can lead to memory overflow for large databases. The remaining two algorithms partition the candidate sequences over the nodes, which can efficiently exploit the total system&#039;s memory as the number of nodes in increased. If it is partitioned simply, customer transaction...
Parallel Mining Algorithms for Generalized Association Rules with Classification Hierarchy.
Association rule mining recently attracted strong attention. Usually, the classification hierarchy over the data items is available. Users are interested in generalized association rules that span different levels of the hierarchy, since sometimes more interesting rules can be derived by taking the hierarchy into account.  In this paper, we propose the new parallel algorithms for mining association rules with classification hierarchy on a shared-nothing parallel machine to improve its performance. Our algorithms partition the candidate itemsets over the processors, which exploits the aggregate memory of the system effectively. If the candidate itemsets are partitioned without considering classification hierarchy, both the items and its all the ancestor items have to be transmitted, that causes prohibitively large amount of communications. Our method minimizes interprocessor communication by considering the hierarchy. Moreover, in our algorithm, the available memory space is fully utili...
Analysis of Cassette Migration Activities in Scalable Tape Archiver.

Implementation and Evaluation of the Bucket Flattening Omega Network of the Parallel Relational Database Server SDC%2DII.
This paper presents the implementation and performance evaluation of the Bucket Flattening Omega Network of the SDC-II, the Super Database Computer II. The SDC-II is a highly parallel relational database server, which consists of eight data processing modules interconnected by two networks. Parallelism in the parallel relational database processing on the shared nothing architecture would suffer from skewed data distribution and collisions in the interconnection networks. The network of the SDC-II was designed to offer an architectural support of the Bucket Spreading hash join algorithm, which enables the system to have linear performance scalability even with skewed data distributions. The additional functionality introduced into the network can generate a flat bucket distribution, which is essential to the algorithm, while providing almost conflict free routing. Each switching unit of the network is implemented on an FPGA chip, and its performance is evaluated to compare with an impl...
Parallel Database Processing%2FData Mining an Large Scale ATM Connected PC Cluster.

Characteristics of a Parallel Data Mining Application Implemented on an ATM Connected PC Cluster.

Preliminary Experimental Results of a Parallel Association Rule Mining on ATM Connected PC Clusters.

Implementation and Performance Evaluation of the Parallel Relational Database Server SDC%2DII.
This paper presents the implementation and performance evaluation of the SDC-II, the Super Database Computer II. The SDC-II is a highly parallel relational database server, which consists of eight data processing modules interconnected by two networks, where each module contains up to seven processors connected by two busses and four disk drives. The SDCII employs several key techniques to efficiently support join-intensive queries: a sophisticated parallel hash join algorithm named &#034;the bucket spreading parallel hash join algorithm,&#034; an efficient data passing mechanism in hardware and software, and an intelligent interconnection network which has an ability to generate a flat bucket distribution and to provide almost conflict free routing. The evaluation results obtained through the join queries with skewed data, show that the SDC-II works quite efficiently under various conditions attaining a high degree of parallelism.  1 Introduction  The wide spread adoption of relational database...
Hash Based Parallel Algorithms for Mining Association Rules.
In this paper, we propose four parallel algorithms (NPA, SPA, HPA and HPA-ELD) for mining association rules on shared-nothing parallel machines to improve its performance.  In NPA, candidate itemsets are just copied amongst all the processors, which can lead to memory overflow for large transaction databases. The remaining three algorithms partition the candidate itemsets over the processors. If it is partitioned simply (SPA), transaction data has to be broadcast to all processors. HPA partitions the candidate itemsets using a hash function to eliminate broadcasting, which also reduces the comparison workload significantly. HPA-ELD fully utilizes the available memory space by detecting the extremely large itemsets and copying them, which is also very effective at flattering the load over the processors.  We implemented these algorithms in a sharednothing environment. Performance evaluations show that the best algorithm, HPA-ELD, attains good linearity on speedup ratio and is effective ...
Hot Mirroring A Study to Hide Parity Upgrade Penalty and Degradations During Rebuilds for RAID5.

Partial Migration in an 8mm Tape Based Tertiary Storage File System and its Performance Evaluation through Satellite Image Processing Applications.
Recent attention on global environmental changes has stimulated  the development of large scale global information systems. Satellite  images play a very important role for understanding these global changes.
Dynamic Join Product Skew Handling for Hash%2DJoins in Shared%2DNothing Database Systems.

Hot Block Clustering for Disk Arrays with Dynamic Striping.

Data Parallel Relational Database Processing on the Connection Machine CM%2D2 with Data Vault.

Dynamic Parity Stripe Reorganizations for RAID5 Disk Arrays.

An Efficient Pointer Swizzling Method for Navigation Intensive Applications.

GREO A Commercial Database Processor Based on A Pipelined Hardware Sorter.

Parallel GRACE Hash Join on Shared%2DEverything Multiprocessor Implementation and Performance Evaluation on Symmetry S81.

Massively Parallel Relational Database Processing on the Connection Machine CM%2D2.

Scheduling Batch Transactions on Shared%2DNothing Parallel Database Machines Effects of Concurrency and Parallelism.

Performance Evaluation of Functional Disk System %28FDS%2DR2%29.

Performance Evaluation of Functional Disk System with Nonuniform Data Distribution.

Concurrency Control of Bulk Access Transactions on Shared Nothing Parallel Database Machines.

Bucket Spreading Parallel Hash A New


Query Processing for Multi%2DAttribute Clustered Records.

Funtional Disk System as a High Performance Relational Storage.

Query Execution for Large Relations on Functional Disk Systems.

Join Strategies on KB%2DTree Indexed Relations.


The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method.

Hash%2DPartitioned Join Method Using Dynamic Destaging Strategy.

Functional Disk System for Relational Database.

Design and Implementation of High Speed Pipeline Merge Sorter with Run Length Tuning Mechanism.

An Overview of The System Software of A Parallel Relational Database Machine GRACE.

Multidimensional Clustering Techniques for Large Relational Database Machines.

Memory Management Algorithms in Pipeline Merge Sorter.

Algorithm and Performance Evaluation of Adaptive Multidimensional Clustering Technique.

Application of Hash to Data Base Machine and Its Architecture.
n and J. Kiernan. A declarative approach to active databases: The A-RDL language and system. In J. Widom and S. Ceri, editors, Active Database Systems: Triggers and Rules for&#039; Advanced Database Processing. Morgan-Kaufmann, Inc., San Francisco, California, 1995. to appear.  D.G. Severance and G.M. Lohman. Differential files: Their application to the maintenance of large databases. ACM Trans. on Database Systems, 1(3), September 1976.  J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, Mass., 1977.  M. Stonebraker. The integration of rule systems and database systems. IEEE Trans. on Knowledge and Data Engineering, 4(5):415 423, October 1992.  J. Widom and S. Ceri. Active Database Systems: Triggers and Rules for Advanced Database Processing. Morgan-Kaufmann, Inc., San Francisco, California, 1995.  J. Widom and S. J. Finkelstein. Set-oriented production rules in relational database systems. In Proc. ACM SIGMOD Syrup. on the
Relational Algebra Machine GRACE.

